Proofs in Context

نویسندگان

  • Giuseppe Attardi
  • Maria Simi
چکیده

When reasoning about reasoning, one often needs to carry out some proof steps within a diierent theory from the current one and then to lift the conclusions back into the original theory. The deductive rules required to carry out these steps involve either reeec-tion principles or some other notion of proof in context. Reeection principles have to be carefully restricted in order to avoid paradoxes. Such restrictions however limit significantly their usefulness and also defeat intuition while building proofs in context. Standard formulations of the reeection rules also assume explicit knowledge of the theory one reasons about. This is not always the case for theories representing agents or for theories which refer to each other, as those required for expressing common knowledge. A careful analysis of proofs dealing with multiple theories which appeared in recent literature reveals steps which are not properly accounted for, improper use of lifting, extra logical constructions or unnecessary assumptions: problems often due to the involved mechanisms of reeection. We show that proof in context can replace the most common uses of reeec-tion principles. Proofs can be carried out by switching to a context and reasoning within it. Context switching does not correspond to reeection or reiication but involves a further level of nesting of theory within another theory. We introduce a generalised rule for proof in context and a convenient notation to express nesting of contexts, which allow us to carry out reasoning about reasoning in a safe and natural way.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Epistemological Study of the Verse Tathir

The verse Tathir is regarded as one of the central verses in proving the infallibility of the Prophet and his future generation`s properties that have long been debated among the Fariqain commentators. The Sunni commentators, without any reasonable proof and only based on the context and etymology of the word al-bait, the house, have viewed all members of Quraysh in the Prophet's House, and in ...

متن کامل

A Formalisation of the Normal Forms of Context-Free Grammars in HOL4

We describe the formalisation of the Chomsky and Greibach normal forms for context-free grammars (CFGs) using the HOL4 theorem prover. We discuss the varying degrees to which proofs that are straightforward on pen and paper, turn out to be much harder to mechanise. While both proofs are of similar length in their informal presentations, the mechanised proofs for Greibach normal form blow-up con...

متن کامل

Lambek Calculus Proofs and Tree Automata

We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus cannot be accepted by a finite tree automaton. The proof is extended to cover the proofs used by grammars based on the Lambek calculus, which typically use only a subset of the set of all proofs. While Lambek grammars can assign...

متن کامل

Probabilistically Checkable Proofs: A Primer

Probabilistically checkable proofs are proofs that can checked probabilistically by reading very few bits of the proof. Roughly ten years back it was shown that proofs could be made probabilistically checkable with a modest increase in their size. While the initial proofs were a little too complex, a recent proof due to Irit Dinur gives a dramatically simple (and radically new) construction of ...

متن کامل

Quranic way of presenting proofs for God`s existence

Regardless of the view of those philosophers like Plantinga who see no need in any proof for the existence of God, scholars have presented four views on Quranic way of proving the existence of God including demonstration, awakening, implication and clear demonstration. Describing and criticizing the views in detail, the author has viewed differently. God has regarded the level of the addressee`...

متن کامل

A formalisation of the Cocke-Younger-Kasami algorithm

The theory provides a formalisation of the Cocke-Younger-Kasami algorithm [1] (CYK for short), an approach to solving the word problem for context-free languages. CYK decides if a word is in the languages generated by a context-free grammar in Chomsky normal form. The formalized algorithm is executable.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994